Some properties of major efficient sets in multi - objective optimization 多目標(biāo)最優(yōu)化中較多有效集的性質(zhì)探討
So if you have an error - free and efficient set of rules added to the packet filtering tables , to use the rules again after a reboot , you have to save the rule set in a file 所以,如果您將沒(méi)有錯(cuò)誤的且有效的規(guī)則集添加到信息包過(guò)濾表,同時(shí)希望在重新引導(dǎo)之后再次使用這些規(guī)則,那么必須將該規(guī)則集保存在文件中。
Using the olap metadata , cube views optimization advisor can now analyze underlying dimensional data and create the most efficient set of materialized query tables mqts for your olap applications 使用olap元數(shù)據(jù), cube views optimization advisor現(xiàn)在可以分析基本的維度數(shù)據(jù)以及為olap應(yīng)用程序創(chuàng)建一組最有效的實(shí)例化的查詢(xún)表( mqt ) 。
The feed - back provided by the reflected electron beams reduce the start - up current and the start - up time in a vircator , while the existence of klystron cavity improves the extracting efficiency , hence the radial reflex klystron oscillator with virtual cathode combines the advantages of both devices , becomes a compact , efficient set 利用虛陰極反射電子束對(duì)調(diào)制腔的正反饋,可以減小起振電流和起振時(shí)間,而且提高了微波產(chǎn)生效率。它是一種結(jié)構(gòu)簡(jiǎn)單,緊湊,不需要引導(dǎo)磁場(chǎng)的器件。
Details are as follows : we deal with properties of bilevel linear programming and prove the equivalence of bilevel linear programming and optimization over the efficient set . a class of multi - objective tow level programming , i . e . the upper - level is single objective and the lower - level is linear multi - objective , is mainly discussed . it can be converted into the optimization over the efficient set with parameter and an algorithm is given with its finite termination being proved ; when the upper - level is linear function , an exact penalty function algorithm is given 分層(分級(jí))遞階系統(tǒng)是社會(huì)組織管理的主要形式,多層規(guī)劃是研究這類(lèi)系統(tǒng)優(yōu)化問(wèn)題的基本模型,其鮮明的實(shí)際背景和廣泛的應(yīng)用前景引起了人們的廣泛關(guān)注,成為一個(gè)新興的活躍的研究領(lǐng)域,本論文研究了二層規(guī)劃中的若干問(wèn)題,主要工作如下:討論了二層線(xiàn)性規(guī)劃的性質(zhì),并證明了它與零有效集上優(yōu)化問(wèn)題的等價(jià)性;對(duì)一類(lèi)二層多目標(biāo)規(guī)劃(上層為單目標(biāo)規(guī)劃、下層為線(xiàn)性多目標(biāo)規(guī)劃的問(wèn)題)進(jìn)行了探討,將其轉(zhuǎn)化為含參變量的有效集上的優(yōu)化問(wèn)題,進(jìn)而給出了一種算法,并證明了該算法的有限終止性;當(dāng)上層為線(xiàn)性單目標(biāo)時(shí),給出了一種罰函數(shù)方法